A Learning-Based Approach for Agile Satellite Onboard Scheduling
نویسندگان
چکیده
منابع مشابه
A constraint-based approach to satellite scheduling
Satellite scheduling, like all scheduling, is the problem of mapping tasks (observation, communication, downlink, control maneuvers, etc.) to resources (sensor satellites, relay satellites, ground stations, etc.). Through our work on satellite scheduling problems, we have encountered many different constraints that are particular to the satellite-scheduling domain. In this paper, we will introd...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملOnboard State Dependent LQR for Agile Quadrotors
State-of-the-art approaches in quadrotor control split the problem into multiple cascaded subproblems, exploiting the different time scales of the rotational and translational dynamics. They calculate a desired acceleration as input for a cascaded attitude controller but omit the attitude dynamics. These approaches use limits on the desired acceleration to maintain feasibility and robustness th...
متن کاملA Symbolic Model Checking Approach to Verifying Satellite Onboard Software
This paper discusses the use of symbolic model checking technology to verify the design of an embedded satellite software control system called attitude and orbit control system (AOCS). This system is mission-critical because it is responsible for maintaining the attitude of the satellite and for performing fault detection, isolation, and recovery decisions of the satellite. An executable AOCS ...
متن کاملAn Approach for Parallel Scheduling for Agile Co Scheduling
Co scheduling deals with minimizing the communication waiting time of parallel processes by identifying the processes in need of Co scheduling through gathering and analyzing implicit runtime information, basically communication events. Synchronization needs of some applications can suffer severe performance penalties if their processes are not all co scheduled to run together. Two common appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2968051